Complete graph

Results: 868



#Item
621Preparing for the IELTS test with Holmesglen Institute of TAFE The writing component The IELTS writing test takes one hour. In this time you are required to complete two tasks. TASK ONE is a report based on some graphic

Preparing for the IELTS test with Holmesglen Institute of TAFE The writing component The IELTS writing test takes one hour. In this time you are required to complete two tasks. TASK ONE is a report based on some graphic

Add to Reading List

Source URL: www.world-english.org

Language: English - Date: 2012-02-08 21:00:35
622On Khot’s unique games conjecture

On Khot’s unique games conjecture

Add to Reading List

Source URL: www.ams.org

Language: English - Date: 2012-05-01 11:13:39
623A Consistent Histogram Estimator for Exchangeable Graph Models

A Consistent Histogram Estimator for Exchangeable Graph Models

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2014-02-17 21:47:29
624Mizan: A System for Dynamic Load Balancing in Large-scale Graph Processing Zuhair Khayyat‡ Karim Awara‡

Mizan: A System for Dynamic Load Balancing in Large-scale Graph Processing Zuhair Khayyat‡ Karim Awara‡

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2013-06-23 20:27:26
625Optimizing Graph Algorithms on Pregel-like Systems  ∗ Semih Salihoglu

Optimizing Graph Algorithms on Pregel-like Systems ∗ Semih Salihoglu

Add to Reading List

Source URL: ilpubs.stanford.edu

Language: English - Date: 2014-01-10 18:29:06
626IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 7, JULY[removed]A New Class of Upper Bounds on the Log Partition Function

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 7, JULY[removed]A New Class of Upper Bounds on the Log Partition Function

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2005-08-15 12:26:48
627TALIP ad-1/2 pg. vertical 4-C

TALIP ad-1/2 pg. vertical 4-C

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2012-09-07 04:32:07
628Algorithmica[removed]: 392–401  Algorithmica ©  1996 Springer-Verlag New York Inc.

Algorithmica[removed]: 392–401 Algorithmica © 1996 Springer-Verlag New York Inc.

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2004-09-11 20:54:49
629Graph Partitioning using Single Commodity Flows Satish Rao Umesh Vazirani  University of Waterloo,

Graph Partitioning using Single Commodity Flows Satish Rao Umesh Vazirani University of Waterloo,

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2007-01-02 19:10:42
630Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering

Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2006-10-30 15:12:10